Set Membership Identification of Linear Systems With Guaranteed Simulation Accuracy

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Set membership identification of switched linear systems with known number of subsystems

This paper addresses the problem of robust identification of a class of discrete-time linear hybrid systems, switched linear models, in a set membership framework. Given a finite collection of noisy input/output data the objective is twofold: (i) establish whether this data was generated by a system that switches amongst an a-priori known number of subsystems, and (ii) in that case identify a s...

متن کامل

Set-membership Parameter Identification of Linear Systems with Multiplicative Uncertainties: A New Algorithm

This paper develops a new set-membership estimation algorithm for the identification of time-varying parameters in linear models, where both additive and multiplicative uncertainties are considered explicitly. We show that a recursive algorithm we develop is capable of providing nonconservative approximations to the feasible solution set. Examples are considered to demonstrate the utility and e...

متن کامل

Enforcing stability constraints in set-membership identification of linear dynamic systems

In this paper we consider the identification of linear systems, a priori known to be stable, from input-output data corrupted by bounded noise. By taking explicitly into account a priori information on system stability, a formal definition of the feasible parameter set for stable linear system is provided. On the basis of a detailed analysis of the geometrical structure of the feasible set, con...

متن کامل

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

متن کامل

Finding All Solutions of Nonlinear Systems of Equations Using Linear Programming with Guaranteed Accuracy

A linear programming-based method is presented for nding all solutions of nonlinear systems of equations with guaranteed accuracy. In this method, a new e ective linear programming-based method is used to delete regions in which solutions do not exist. On the other hand, Krawczyk's method is used to nd regions in which solutions exist. As an illustrative example, all solutions of the nonlinear ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2020

ISSN: 0018-9286,1558-2523,2334-3303

DOI: 10.1109/tac.2020.2970146